Removing circuits in 3-connected binary matroids
نویسندگان
چکیده
منابع مشابه
Removing circuits in 3-connected binary matroids
For a k-connected graph or matroid M , where k is a fixed positive integer, we say that a subset X of E(M) is k-removable provided M\X is k-connected. In this paper, we obtain a sharp condition on the size of a 3connected binary matroid to have a 3-removable circuit.
متن کاملThe 3-connected Binary Matroids with Circumference
In this paper, we construct all 3-connected binary matroids with circumference equal to 6 or 7 having large rank.
متن کاملRemovable Circuits in Binary Matroids
We show that if M is a connected binary matroid of cogirth at least ve which does not have both an F 7-minor and an F 7-minor, then M has a circuit C such that M ? C is connected and r(M ? C) = r(M).
متن کاملInvolutions Of Connected Binary Matroids
We prove that if an involution φ is an automorphism of a connected binary matroid M , then there is a hyperplane of M that is invariant under φ. We also consider extensions of this result for higher connectivity.
متن کاملThe 3-connected binary matroids with circumference 6 or 7
In this paper, we construct all 3-connected binary matroids with circumference equal to 6 or 7 having large rank. © 2008 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.095